Computing the Stackelberg/Nash Equilibria Using the Extraproximal Method: Convergence Analysis and Implementation Details for Markov Chains Games

نویسندگان

  • Kristal K. Trejo
  • Julio B. Clempner
  • Alexander S. Poznyak
چکیده

In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov’s regularization method is employed to ensure the convergence of the cost-functions to a Stackelberg/Nash equilibrium point. Then, we transform the problem into a system of equations in the proximal format. We present a two-step iterated procedure for solving the extraproximal method: (a) the first step (the extra-proximal step) consists of a “prediction” which calculates the preliminary position approximation to the equilibrium point, and (b) the second step is designed to find a “basic adjustment” of the previous prediction. The procedure is called the “extraproximal method” because of the use of an extrapolation. Each equation in this system is an optimization problem for which the necessary and efficient condition for a minimum is solved using a quadratic programming method. This solution approach provides a drastically quicker rate of convergence to the equilibrium point. We present the analysis of the convergence as well the rate of convergence of the method, which is one of the main results of this paper. Additionally, the extraproximal method is developed in terms of Markov chains for Stackelberg games. Our goal is to analyze completely a three-player Stackelberg game consisting of a leader and two followers. We provide all the details needed to implement the extraproximal method in an efficient and numerically stable way. For instance, a numerical technique is presented for computing the first step parameter (λ) of the extraproximal method. The usefulness of the approach is successfully demonstrated by a numerical example related to a pricing oligopoly model for airlines companies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Stackelberg Security Games For Multiple Defenders and Multiple Attackers

In the last years, there has been a substantial effort in the application of Stackelberg game-theoretic approaches in the security arena, in which security agencies implement patrols and checkpoints to protect targets from criminal attacks. The classical game-theoretic approach employed successful to solve security games is that of a Stackelberg game between a defender (leader) and an attacker ...

متن کامل

Extraproximal Method for Markov Chains Finite Games

In this paper a regularized version of the”extraproximal method” is suggested to be applied for finding a Nash equilibrium in a multi­participant finite game where the dynamics of each player is governed by a finite controllable Markov chain. The suggested iterative technique realizes the application of a two­step procedure at each iteration: at the first (or preliminary) step some ”predictive ...

متن کامل

Pricing and Advertising Decisions in a Three-level Supply Chain with Nash, Stackelberg and Cooperative Games

Pricing and advertising are two important marketing strategies in the supply chain management which lead to customer demand’s increase and therefore higher profit for members of supply chains. This paper considers advertising, and pricing decisions simultaneously for a three-level supply chain with one supplier, one manufacturer and one retailer. The amount of market demand is influenced ...

متن کامل

Market power influential approach using game theory in a two competing supply chains with multi-echelons under centralized/decentralized environments

This paper is considering the competition between two multi-echelon supply-chains on price and service under balance and imbalance of market power between the chains which are analyzing through Nash and Stackelberg game approach. The problem is categorized as the centralized or decentralized structure of each chain, which means a few different possible scenarios are developing based on the Nash...

متن کامل

Dynamic Quadratic Cheap Talk and Signaling Games

Simultaneous (Nash) and sequential (Stackelberg) equilibria of two-player dynamic quadratic cheap talk and signaling game problems are investigated under a perfect Bayesian formulation. For the dynamic scalar cheap talk, a zero-delay communication setup is considered for i.i.d. and Markov sources; it is shown that the final stage equilibrium is always quantized and under further restrictive con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computer Science

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2015